Globally deterministic CD-systems of stateless R-automata with window size 1
نویسندگان
چکیده
منابع مشابه
On Globally Deterministic CD-Systems of Stateless R-Automata with Window Size One
It is known that cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 accept a class of semi-linear languages that properly includes all rational trace languages. Although the component automata of such a CD-system are all deterministic, the CD-system itself is not, as in each of its computations, the initial component and the successor ...
متن کاملOn CD-systems of stateless deterministic R-automata with window size one
Here we study cooperating distributed systems (CD-systems) of restarting automata that are very restricted: they are deterministic, they cannot rewrite, but only delete symbols, they restart immediately after performing a delete operation, they are stateless, and they have a read/write window of size 1 only, that is, these are stateless deterministic R(1)-automata. We study the expressive power...
متن کاملCD-systems of stateless deterministic R(1)-automata governed by an external pushdown store
We study cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size 1 that are governed by an external pushdown store. In this way we obtain an automata-theoretical characterization for the class of context-free trace languages.
متن کاملOn Some Decision Problems for Stateless Deterministic Ordered Restarting Automata
The stateless deterministic ordered restarting automata accept exactly the regular languages, and it is known that the trade-off for turning a stateless deterministic ordered restarting automaton into an equivalent DFA is at least double exponential. Here we present a construction that yields an equivalent NFA of size 2 from a stateless deterministic ordered restarting automaton that works on a...
متن کاملOn Stateless Automata and P Systems
We introduce the notion of stateless multihead two-way (respectively, oneway) NFAs and stateless multicounter systems and relate them to P systems and vector addition systems. In particular, we investigate the decidability of the emptiness and reachability problems for these stateless automata and show that the results are applicable to similar questions concerning certain variants of P systems...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Mathematics
سال: 2013
ISSN: 0020-7160,1029-0265
DOI: 10.1080/00207160.2012.688820